A Multi-class Pattern Recognition Method by Combined Use of Multinomial Logit Model and K-Nearest Neighbor Rule
نویسندگان
چکیده
In this paper, we propose a method for multi-class pattern classification by combined use of Multinomial Logit Model (MLM) and K-nearest neighbor rule (KNN). Multinomial Logit Model (MLM) is one of the neural network models for multi-class pattern classification, and is supposed to be equal or better in class&cation performance than linear classification methods. K-NN is a simple but powerful non-parametric classification tool whose error probability does not exceed double of byes error. However, it is also known that such high performance of K-NN is not always expected if number of dimension of input feature vector space is large. Therefore, first we train MLM using the training vectors, and then apply K-NN to the output of the MLM. By this, since K-NN is applied to the compressed low dimension vectors, it is expected not only to bring out natural performance of K-NN but also to shorten computation time. Evaluation experiments were conducted by using some sets of non-artificial samples extracted from the handwritten character image database "ETL6". Those are (1) 36classes (number + English capital letter), and (2) 82-classes (number + English capital letter + "Katakana" letter). Consequently, we obtained the following recognition rates: (1) 36classes =. 100.0%, and (2) 82-classes =. 99.93%.
منابع مشابه
Presentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition
Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...
متن کاملPresentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition
Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...
متن کاملA new edited k-nearest neighbor rule in the pattern classification problem
A new edited k-nearest neighbor (k}NN) rule is proposed. For every sample y in the edited reference set, all the kor (k#l)-nearest neighbors of y must be in the class to which y belongs. Here l denotes the number of samples which tie with the kth nearest neighbor of y with respect to the distance from y. The performance of the rule proposed has been investigated using three classi"cation exampl...
متن کاملNeighborhood size selection in the k-nearest-neighbor rule using statistical confidence
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this work, we propose a new method for neighborhood size selection that is based on the concept of statistical confidence. We define the confidence associated with a decision that is made by the majority rule from a finite num...
متن کاملPattern Recognition Method for Metric Space by Four Points Embedding
In solving pattern recognition problem in the Euclidean space, prototypes representing classes are de ned. On the other hand in the metric space, Nearest Neighbor method and K-Nearest Neighbor method are frequently used without de ning any prototypes. In this paper, we propose a new pattern recognition method for the metric space that can use prototypes which are the centroid of any three patte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002